A note on generalizing the maximum lateness criterion for scheduling
نویسندگان
چکیده
منابع مشابه
Improved dynamic programs for batching problems with maximum lateness criterion
We study a class of scheduling problems involving the maximum lateness criterion and an element of batching For all the problems that we examine algorithms appear in the literature which consist of a sorting step to determine an optimal job sequence followed by a dynamic programming step which determines the optimal batches In each case the dynamic program is based on a backward recursion of wh...
متن کاملBatch scheduling to minimize maximum lateness
We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem. © 1997 Elsevier Science B.V. Kevwords: Analysis of algorithms; Dynamic programming; Production/scheduling
متن کاملScheduling on uniform parallel machines to minimize maximum lateness
We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the EDD rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than pmax, where pmax is the maximum job processing time. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملA Note on the Bivariate Maximum Entropy Modeling
Let X=(X1 ,X2 ) be a continuous random vector. Under the assumption that the marginal distributions of X1 and X2 are given, we develop models for vector X when there is partial information about the dependence structure between X1 and X2. The models which are obtained based on well-known Principle of Maximum Entropy are called the maximum entropy (ME) mo...
متن کاملAn Optimal Parallel Algorithm for Preemptive Job Scheduling that Minimizes Maximum Lateness
In this paper we present the Preemptive Minimize Maximum Lateness algorithm, an optimal parallel algorithm that schedules jobs for execution on a single processor machine with preemption. Each job is described by a release time, a deadline and a processing time. A job is considered late if it does not complete by its deadline and its lateness is defined as the difference between its completion ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90087-5